On the Complexity of Deciding Degeneracy in Games
نویسنده
چکیده
We show that it is NP-Complete to decide whether a bimatrix game is degenerate and it is Co-NP-Complete to decide whether a bimatrix game is nondegenerate.
منابع مشابه
Cooperative Benefit and Cost Games under Fairness Concerns
Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...
متن کاملDeciding the Winner in Parity Games Is in UP ∩ co-UP
We observe that the problem of deciding the winner in mean payoff games is in the complexity class UP ∩ co-UP. We also show a simple reduction from parity games to mean payoff games. From this it follows that deciding the winner in parity games and the modal μ-calculus model checking are in UP ∩ co-UP.
متن کاملEnergy parity games☆
Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy ...
متن کاملFinding Dense Subgraphs of Sparse Graphs
We investigate the computational complexity of the Densestk-Subgraph (DkS) problem, where the input is an undirected graph G = (V,E) and one wants to find a subgraph on exactly k vertices with a maximum number of edges. We extend previous work on DkS by studying its parameterized complexity. On the positive side, we show that, when fixing some constant minimum density μ of the sought subgraph, ...
متن کاملPlaying Games with Boxes and Diamonds
Deciding in nite two-player games on nite graphs with the winning condition speci ed by a linear temporal logic (Ltl) formula, is known to be 2Exptime-complete. The previously known hardness proofs encode Turing machine computations using the next and/or until operators. Furthermore, in the case of model checking, disallowing next and until, and retaining only the always and eventually operator...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/0905.3012 شماره
صفحات -
تاریخ انتشار 2009